FEM-like Fast Marching Method for the Computation of the Boat-Sail Distance and the Associated Voronoi Diagram
نویسندگان
چکیده
A new concept called a boat-sail distance is introduced on the surface of water with flow, and it is used to define a generalized Voronoi diagram, in such a way that the water surface is partitioned into regions belonging to the nearest harbors with respect to this distance. The problem of computing this Voronoi diagram is reduced to a boundary value problem of a partial differential equation, and a numerical method for solving this problem is constructed. The method is a modification of a so-called fast marching method originally proposed for the eikonal equation. Computational experiments show the efficiency and the stableness of the proposal method. keywords: Boat-sail Distance, Voronoi Diagram, Eikonal Equation, Fast Marching Method, FEMlike scheme
منابع مشابه
Fast Finite Element Method Using Multi-Step Mesh Process
This paper introduces a new method for accelerating current sluggish FEM and improving memory demand in FEM problems with high node resolution or bulky structures. Like most of the numerical methods, FEM results to a matrix equation which normally has huge dimension. Breaking the main matrix equation into several smaller size matrices, the solving procedure can be accelerated. For implementing ...
متن کاملPolygonal Approximation of Voronoi Diagrams of a Set of Triangles in Three Dimensions
We describe a robust adaptive marching tetrahedra type algorithm for constructing a polygonal approximation of the Voronoi Diagram of an arbitrary set of triangles in three dimensions. Space is adaptively subdivided into a set of tetrahedral cells, and the set of Voronoi regions which intersect each cell is determined exactly using a simple primitive we introduce. We obtain a small number of di...
متن کاملFast Voronoi Diagrams and O sets on Triangulated Surfaces
We apply the Fast Marching Method on triangulated domains to e ciently compute Voronoi diagrams and o set curves on triangulated manifolds. The computational complexity of the proposed algorithm is optimal, O(M logM), where M is the number of vertices. The algorithm also applies to weighted domains in which a di erent cost is assigned to each surface point.
متن کاملCrystal Voronoi diagram and its applications
This paper studies the multiplicatively weighted crystal-growth Voronoi diagram, which describes the partition of the plane into crystals with different growth speeds. This type of the Voronoi diagram is defined, and its basic properties are investigated. The analytic equation describing the boundary curve is given for a simple case. For the general case, an approximation algorithm is proposed....
متن کاملA wind-independent control strategy for autonomous sailboats based on Voronoi diagram
This paper proposes a new control strategy based on Voronoi diagram for autonomous sailboats. This strategy applies the method of Voronoi diagram to decompose the space and uses a lookup table to make the boat sail as planned. The contribution of this paper is that for the first time it proposes an approach to control autonomous sailboats without the data from wind sensors (with data from GPS a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003